On the Toughness of Cycle Permutation Graphs
نویسندگان
چکیده
منابع مشابه
On the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملon the tenacity of cycle permutation graph
a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn( α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملOn the Toughness of Graphs
The toughness of a graph is the graph’s vulnerability to having vertices removed. For example, if vertices of the graph represent homes, and the edge of the graph represent telephone lines connecting them, then the toughness measures how badly telephone communication can broken down by relatively few lightening strikes. In this paper the maximum networks are obtained with prescribed order and t...
متن کاملIsomorphism classes of cycle permutation graphs
Kwak, J.H. and J. Lee, Isomorphism classes of cycle permutation graphs, Discrete Mathematics 105 (1992) 131-142. In this paper, we construct a cycle permutation graph as a covering graph over the dumbbell graph, and give a new characterization of when two given cycle permutation graphs are isomorphic by a positive or a negative natural isomorphism. Also, we count the isomorphism classes of cycl...
متن کاملNormalized Tenacity and Normalized Toughness of Graphs
In this paper, we introduce the novel parameters indicating Normalized Tenacity ($T_N$) and Normalized Toughness ($t_N$) by a modification on existing Tenacity and Toughness parameters. Using these new parameters enables the graphs with different orders be comparable with each other regarding their vulnerabilities. These parameters are reviewed and discussed for some special graphs as well.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2001
ISSN: 0011-4642,1572-9141
DOI: 10.1023/a:1013786612087